DOMINATION ON LEXICOGRAPHICAL PRODUCT OF COMPLETE GRAPHS
نویسندگان
چکیده
منابع مشابه
Domination games played on line graphs of complete multipartite graphs
The domination game on a graph G (introduced by B. Brešar, S. Klavžar, D.F. Rall [1]) consists of two players, Dominator and Staller, who take turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible, and Staller wishes to delay this process as much as po...
متن کاملDomination in colored complete graphs
We prove the following conjecture of Erdljs and Hajnal: For any fixed positive integer t and for any 2-coloring of the edges of K,, there exists X c V(K,) such that 1x1 I t and X monochromatically dominates all but at most n/2’ vertices of K,. In fact, X can be constructed by a fast greedy algorithm.
متن کاملPower Domination in Product Graphs
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dominating sets in graphs. The power domination number γP (G) of G is the minimum cardinality of a power dominating set. Dorfling and Henning [2] determined the power domination number of the Cartesian product of paths. I...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملDomination by Union of Complete Graphs
Let G be a graph with domination number γ(G). A dominating set S ⊆ V (G) has property UK if all components of the subgraph it induces in G are complete. The union of complete graphs domination number of a graph G, denoted γuk(G), is the minimum possible size of a dominating set of G, which has property UK. Results on changing and unchanging of γuk after vertex removal are presented. Also forbid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2013
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v85i4.10